Triangulations without pointed spanning trees
نویسندگان
چکیده
منابع مشابه
Triangulations without pointed spanning trees
Problem 50 in the Open Problems Project of the computational geometry community asks whether any triangulation on a point set in the plane contains a pointed spanning tree as a subgraph. We provide a counterexample. As a consequence we show that there exist triangulations which require a linear number of edge flips to become Hamiltonian.
متن کاملTransforming spanning trees and pseudo-triangulations
Let TS be the set of all crossing-free straight line spanning trees of a planar n-point set S. Consider the graph TS where two members T and T ′ of TS are adjacent if T intersects T ′ only in points of S or in common edges. We prove that the diameter of TS is O(log k), where k denotes the number of convex layers of S. Based on this result, we show that the flip graph PS of pseudo-triangulations...
متن کاملCompatible pointed pseudo-triangulations
For a given point set S (in general position), two pointed pseudo-triangulations are compatible if their union is plane. We show that for any set S there exist two maximally disjoint compatible pointed pseudotriangulations, that is, their union is a triangulation of S. In contrast, we show that there are point sets S and pointed pseudo-triangulations T such that there exists no pointed pseudo-t...
متن کاملPlane Triangulations Without a Spanning Halin Subgraph II
A Halin graph is a plane graph constructed from a planar drawing of a tree by connecting all leaves of the tree with a cycle which passes around the boundary of the graph. The tree must have four or more vertices and no vertices of degree two. Halin graphs have many nice properties such as being Hamiltonian and remain Hamiltonian after any single vertex deletion. In 1975, Lovász and Plummer con...
متن کاملPointed Encompassing Trees
It is shown that for any set of disjoint line segments in the plane there exists a pointed binary encompassing tree, that is, a spanning tree on the segment endpoints that contains all input segments, has maximal degree three, and such that every vertex is incident to an angle greater than π. As a consequence, it follows that every set of disjoint line segments has a bounded degree pseudo-trian...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Computational Geometry
سال: 2008
ISSN: 0925-7721
DOI: 10.1016/j.comgeo.2007.07.006